On the composition problem for OBDDs with multiple variable ordersSLOBODOVA, A.Lecture notes in computer science. 1998, pp 645-655, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Encoding the Hydra battle as a rewrite systemTOUZET, H.Lecture notes in computer science. 1998, pp 267-276, issn 0302-9743, isbn 3-540-64827-5Conference Paper

On Boolean vs. modular arithmetic for circuits and communication protocolsDAMM, C.Lecture notes in computer science. 1998, pp 780-788, issn 0302-9743, isbn 3-540-64827-5Conference Paper

One quantifier will do in existential monadic second-order logic over picturesMATZ, O.Lecture notes in computer science. 1998, pp 751-759, issn 0302-9743, isbn 3-540-64827-5Conference Paper

The semi-full closure of Pure Type SystemsBARTHE, G.Lecture notes in computer science. 1998, pp 316-325, issn 0302-9743, isbn 3-540-64827-5Conference Paper

MFCS'98 : mathematical foundations of computer science 1998 (Brno, 24-28 August 1998)Brim, Lubos; Gruska, Josef; Zlatuska, Jirí et al.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-64827-5, XVII, 846 p, isbn 3-540-64827-5Conference Proceedings

Deadlocking states in context-free process algebraSRBA, J.Lecture notes in computer science. 1998, pp 388-398, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Satisfiability : Algorithms and logicPUDLAK, P.Lecture notes in computer science. 1998, pp 129-141, issn 0302-9743, isbn 3-540-64827-5Conference Paper

The head hierarchy for oblivious finite automata with polynomial advice collapsesPETERSEN, H.Lecture notes in computer science. 1998, pp 296-304, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Towards a theory of recursive structuresHAREL, D.Lecture notes in computer science. 1998, pp 36-53, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Characterization of sensitive linear cellular automata with respect to the counting distanceMANZINI, G.Lecture notes in computer science. 1998, pp 825-833, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Expressive completeness of temporal Logic of actionRABINOVICH, A.Lecture notes in computer science. 1998, pp 229-238, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Gaussian elimination and a characterization of algebraic power seriesKUICH, W.Lecture notes in computer science. 1998, pp 512-521, issn 0302-9743, isbn 3-540-64827-5Conference Paper

On the role of time and space in neural computationMAASS, W.Lecture notes in computer science. 1998, pp 72-83, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Polymorphic subtyping without distributivityCHRZASZCZ, J.Lecture notes in computer science. 1998, pp 346-355, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Speeding-up nondeterministic single-tape off-line computations by one alternationWIEDERMANN, J.Lecture notes in computer science. 1998, pp 607-615, issn 0302-9743, isbn 3-540-64827-5Conference Paper

When can an equational simple graph be generated by hyperedge replacement?BARTHELMANN, K.Lecture notes in computer science. 1998, pp 543-552, issn 0302-9743, isbn 3-540-64827-5Conference Paper

A finite hierarchy of the recursively enumerable real numbersWEIHRAUCH, K; XIZHONG ZHENG.Lecture notes in computer science. 1998, pp 798-806, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Computing ∈-free NFA from regular expressions in O(n log²(n)) timeHAGENAH, C; MUSCHOLL, A.Lecture notes in computer science. 1998, pp 277-285, issn 0302-9743, isbn 3-540-64827-5Conference Paper

On the word, subsumption, and complement problem for recurrent term schematizationsHERMANN, M; SALZER, G.Lecture notes in computer science. 1998, pp 257-266, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Topological definitions of chaos applied to cellular automata dynamicsCATTANEO, G; MARGARA, L.Lecture notes in computer science. 1998, pp 816-824, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Approximating maximum independent sets in uniform hypergraphsHOFMEISTER, T; LEFMANN, H.Lecture notes in computer science. 1998, pp 562-570, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Average-case intractability vs. worst-case intractabilityKÖBLER, J; SCHULER, R.Lecture notes in computer science. 1998, pp 493-502, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Comparison between the complexity of a function and the complexity of its graphDURAND, B; PORROT, S.Lecture notes in computer science. 1998, pp 732-739, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Modularization and abstraction : The keys to practical formal verificationKESTEN, Y; PNUELI, A.Lecture notes in computer science. 1998, pp 54-71, issn 0302-9743, isbn 3-540-64827-5Conference Paper